- chromatic tree
- т. граф.раскрашенное дерево
English-Russian scientific dictionary. 2008.
chromatic tree
Смотреть что такое "chromatic tree" в других словарях:
Chromatic polynomial — All nonisomorphic graphs on 3 vertices and their chromatic polynomials, clockwise from the top. The independent 3 set: k3. An edge and a single vertex: k2(k − 1). The 3 path: k(k − 1)2. The 3 clique … Wikipedia
Tree (graph theory) — Trees A labeled tree with 6 vertices and 5 edges Vertices v Edges v 1 Chromatic number … Wikipedia
Infrared photography — Top: tree photographed in the near infrared range. Bottom: same tree in the visible part of the spectrum … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
List of Advanced Dungeons & Dragons 2nd edition monsters — See also: Lists of Dungeons Dragons monsters This is the list of Advanced Dungeons Dragons 2nd edition monsters, an important element of that role playing game.[1] This list only includes monsters from official Advanced Dungeons Dragons 2nd… … Wikipedia
Kaval — This article is about the flute. For the city in Iran, see Kavar. For the professional wrestler formerly known as Kaval, see Low Ki. Kaval Bulgarian kaval in C (До) made in 2009 from European Cornel (Cornus mas) Дрян Classification … Wikipedia
Star (graph theory) — Star The star S7. (Some authors index this as S8.) Vertices k+1 Edges k … Wikipedia
Tutte polynomial — This article is about the Tutte polynomial of a graph. For the Tutte polynomial of a matroid, see Matroid. The polynomial x4 + x3 + x2y is the Tutte polynomial of the Bull graph. The red line shows the intersection with the plane … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
Null graph — In the mathematical field of graph theory, the null graph may refer either to the order zero graph, or alternatively, to any edgeless graph (the latter is sometimes called an empty graph). Contents 1 Order zero graph 2 Edgeless graph 3 See also … Wikipedia
